Scalable and Efficient Reasoning for Enforcing Role%2DBased Access Control.

Private record matching using differential privacy.

A Game%2DTheoretical Approach for Finding Optimal Strategies in a Botnet Defense Model.



Incentive Compatible Distributed Data Mining.

Building Disclosure Risk Aware Query Optimizers for Relational Databases.
Many DBMS products in the market provide built in encryption support to deal with the security concerns of the organizations. This solution is quite effective in preventing data leakage from compromised/stolen storage devices. However, recent studies show that a significant part of the leaked records have been done so by using specialized malwares that can access the main memory of systems. These malwares can easily capture the sensitive information that are decrypted in the memory including the cryptographic keys used to decrypt them. This can further compromise the security of data residing on disk that are encrypted with the same keys. In this paper we quantify the disclosure risk of encrypted data in a relational DBMS for main memorybased attacks and propose modifications to the standard query processing mechanism to minimize such risks. Specifically, we propose query optimization techniques and disclosure models to design a data-sensitivity aware query optimizer. We implemented a prototype DBMS by modifying both the storage engine and optimizer of MySQL-InnoDB server. The experimental results show that the disclosure risk of such attacks can be reduced dramatically while incurring a small performance overhead in most cases. 1.
The Challenge of Assuring Data Trustworthiness.

Privacy Preserving Decision Tree Mining from Perturbed Data.

Real%2DTime Knowledge Discovery and Dissemination for Intelligence Analysis.
This paper describes the issues and challenges for real-time knowledge discovery and then discusses approaches and challenges for real-time data mining and stream mining. Our goal is to extract accurate information to support the emergency responder, the war fighter, as well as the intelligence analyst in a timely manner. 
Using Anonymized Data for Classification.

On the mitigation of bioterrorism through game theory.

Social network classification incorporating link type values.

Assured Information Sharing Life Cycle.

Design and implementation of a secure social network system.

Assured Information Sharing Life Cycle.

Design of a temporal geosocial semantic web for military stabilization and reconstruction operations.

Building a Geosocial Semantic Web for Military Stabilization and Reconstruction Operations.

An Efficient Approximate Protocol for Privacy%2DPreserving Association Rule Mining.

A semantic web based framework for social network access control.

A Hybrid Technique for Private Location%2DBased Queries with Database Protection.

Query Optimization in Encrypted Relational Databases by Vertical Schema Partitioning.

Query Processing Techniques for Compliance with Data Confidence Policies.

Inferring private information using social network data.
Online social networks, such as Facebook, are increasingly utilized by many users. These networks allow people to publish details about themselves and connect to their friends. Some of the information revealed inside these networks is private and it is possible that corporations could use learning algorithms on the released data to predict undisclosed private information. In this paper, we propose an effective, scalable inference attack for released social networking data to infer undisclosed private information about individuals. We then explore the effectiveness of possible sanitization techniques that can be used to combat such an inference attack. 1
Horizontally Partitioned Data.
bugün oldu˘gum yere asla gelemez idim. Bu yüzden doktora tezimi size adıyorum. Sizin hakkınızı asla ödeyemem. Umarim size lǎyik bir evlat olabilmi¸simdir. iii ACKNOWLEDGMENTS I feel extremely lucky to have been advised by Prof. Chris Clifton. He has been a great mentor and a good role model. He has always kept his door open to me and patiently answered all my questions. He has helped me in my research and in many practical issues like how to fix my car. Without him, I would not have been able to complete my degree. I also would like to acknowledge the huge contributions of my other committee members. Prof. Mike Atallah has made many useful suggestions related to my research. Discussions with him have been enlightening and inspiring. Prof. Elisa Bertino has been very supportive during my job hunt. Her wonderful database security course has helped me in seeing the big picture. Our discussions with her
Secure Multiparty Computation Methods.
We introduce a novel approach to general secure multiparty computation that avoids the intensive use of verifiable secret sharing characterizing nearly all previous protocols in the literature. Instead, our scheme involves manipulation of ciphertexts for which the underlying private key is shared by participants in the computation. The benefits of this protocol include a high degree of conceptual and structural simplicity, low message complexity, and substantial flexibility with respect to input and output value formats. We refer to this new approach as mix and match. While the atomic operations in mix and match are logical operations, rather than full field operations as in previous approaches, the techniques we introduce are nonetheless highly practical for computations involving intensive bitwise manipulation. One application for which mix and match is particularly well suited is that of sealed-bid auctions. Thus, as another contribution in this paper, we present a practical, mix-and-match-based auction protocol that is fully private and non-interactive and may be readily adapted to a wide range of auction strategies.
Formal anonymity models for efficient privacy%2Dpreserving joins.



A Hybrid Approach to Private Record Linkage.

Simulating bioterrorism through epidemiology approximation.

A Privacy%2DPreserving Framework for Integrating Person%2DSpecific Databases.

An Approach to Evaluate Data Trustworthiness Based on Data Provenance.

Geospatial Semantic Web%2C Definition.

Privacy and Security Challenges in GIS.

The applicability of the perturbation based privacy preserving data mining for real%2Dworld data.

Transforming semi%2Dhonest protocols to ensure accountability.

A Cryptographic Approach to Securely Share and Query Genomic Sequences.

An Approach to Securely Identifying Beneficial Collaboration in Decentralized Logistics Systems.
doi 10.1287/msom.1070.0167
Privacy%2Dpreserving decision trees over vertically partitioned data.
Abstract. Privacy and security concerns can prevent sharing of data, derailing data mining projects. Distributed knowledge discovery, if done correctly, can alleviate this problem. In this paper, we tackle the problem of classification. We introduce a generalized privacy preserving variant of the ID3 algorithm for vertically partitioned data distributed over two or more parties. Along with the algorithm, we give a complete proof of security that gives a tight bound on the information revealed. 1
Privacy%2Dpreserving Na%EFve Bayes classification.

Enforcing Honesty in Assured Information Sharing Within a Distributed System.

Design and Analysis of Querying Encrypted Data in Relational Databases.

Design and Analysis of Querying Encrypted Data in Relational Databases.

Privacy%2DPreserving Data Mining Applications in the Malicious Model.

Managing Risks in RBAC Employed Distributed Environments.

Extended RBAC%2Dbased design and implementation for a secure data warehouse.

Virtual Active Network for Live Streaming Media Delivery.

Sovereign Joins.
We present a secure network service for sovereign information sharing whose only trusted component is an off-theshelf secure coprocessor. The participating data providers send encrypted relations to the service that sends the encrypted results to the recipients. The technical challenge in implementing such a service arises from the limited capability of the secure coprocessors: they have small memory, no attached disk, and no facility for communicating directly with other machines in the network. The internal state of an ongoing computation within the secure coprocessor cannot be seen from outside, but its interactions with the server can be exploited by an adversary. We formulate the problem of computing join in this setting where the goal is to prevent information leakage through patterns in I/O while maximizing performance. We specify criteria for proving the security of a join algorithm and provide provably safe algorithms. These algorithms can be used to compute general joins involving arbitrary predicates and multiple sovereign databases. We thus enable a new class of applications requiring query processing across sovereign entities such that nothing apart from the result is revealed to the recipients. 1
Security Issues in Querying Encrypted Data.
There has been considerable interest in querying encrypted data,  allowing a &#034;secure database server&#034; model where the server does not  know data values. This paper shows how results from cryptography  prove the impossibility of developing a server that meets cryptographicstyle  definitions of security and is still e#cient enough to be practical.
Privacy%2Dpreserving data integration and sharing.
The goal of this paper is to identify potential research directions and challenges that need to be addressed to perform privacy preserving data integration. Increasing privacy and security consciousness has lead to increased research (and development) of methods that compute useful information in a secure fashion. Data integration and sharing have been a long standing challenge for the database community. This need has become critical in numerous contexts, including integrating data on the Web and at enterprises, building ecommerce market places, sharing data for scientific research, data exchange at government agencies, monitoring health crises, and improving homeland security. Unfortunately, data integration and sharing are hampered by legitimate and widespread privacy concerns. Companies could exchange information to boost productivity, but are prevented by fear of being exploited by competitors or antitrust concerns. Sharing healthcare data could improve scientific research, but the cost of obtaining consent to use individually identifiable information can be prohibitive. Sharing healthcare and consumer data enables early detection of disease outbreak[16], but without provable privacy protection it is difficult to extend these surveillance measures nationally or internationally. Fire departments could
When do data mining results violate privacy%3F
bugün oldu˘gum yere asla gelemez idim. Bu yüzden doktora tezimi size adıyorum. Sizin hakkınızı asla ödeyemem. Umarim size lǎyik bir evlat olabilmi¸simdir. iii ACKNOWLEDGMENTS I feel extremely lucky to have been advised by Prof. Chris Clifton. He has been a great mentor and a good role model. He has always kept his door open to me and patiently answered all my questions. He has helped me in my research and in many practical issues like how to fix my car. Without him, I would not have been able to complete my degree. I also would like to acknowledge the huge contributions of my other committee members. Prof. Mike Atallah has made many useful suggestions related to my research. Discussions with him have been enlightening and inspiring. Prof. Elisa Bertino has been very supportive during my job hunt. Her wonderful database security course has helped me in seeing the big picture. Our discussions with her
Privately Computing a Distributed k%2Dnn Classifier.
Abstract. The ability of databases to organize and share data often raises privacy concerns. Data warehousing combined with data mining, bringing data from multiple sources under a single authority, increases the risk of privacy violations. Privacy preserving data mining provides a means of addressing this issue, particularly if data mining is done in a way that doesn’t disclose information beyond the result. This paper presents a method for privately computing k − nn classification from distributed sources without revealing any information about the sources or their data, other than that revealed by the final classification result. 1
On demand synchronization and load distribution for database grid%2Dbased Web applications.

Privacy%2DPreserving Distributed Mining of Association Rules on Horizontally Partitioned Data.
Data mining can extract important knowledge from large data collections -- but sometimes these collections are split among various parties. Privacy concerns may prevent the parties from directly sharing the data, and some types of information about the data. This paper addresses secure mining of association rules over horizontally partitioned data. The methods incorporate cryptographic techniques to minimize the information shared, while adding little overhead to the mining task.
Assuring privacy when big brother is watching.
Homeland security measures are increasing the amount of data collected, processed and mined. At the same time, owners of the data raised legitimate concern about their privacy and potential abuses of the data. Privacy-preserving data mining techniques enable learning models without violating privacy. This paper addresses a complementary problem: What if we want to apply a model without revealing it? This paper presents a method to apply classification rules without revealing either the data or the rules. In addition, the rules can be verified not to use “forbidden ” criteria.
Privacy%2DPreserving Distributed Mining of Association Rules on Horizontally Partitioned Data.
Data mining can extract important knowledge from large data collections -- but sometimes these collections are split among various parties. Privacy concerns may prevent the parties from directly sharing the data, and some types of information about the data. This paper addresses secure mining of association rules over horizontally partitioned data. The methods incorporate cryptographic techniques to minimize the information shared, while adding little overhead to the mining task.
Tools for Privacy Preserving Data Mining.
We provide here an overview of the new and rapidly emerging research area of privacy preserving data mining. We also propose a classification hierarchy that sets the basis for analyzing the work which has been performed in this context. A detailed review of the work accomplished in this area is also given, along with the coordinates of each work to the classification hierarchy. A brief evaluation is performed, and some initial conclusions are made.
Mining Cyclically Repeated Patterns.
The search for weak periodic signals in time series data is an active  topic of research. Given the fact that rarely a real world dataset is perfectly periodic,  this paper approaches this problem in terms of data mining, trying to  discover approximate and partial periodicities, when no period length is  known in advance. We utilize the autocorrelation function in order to extract  partial periodicities from large time series. In existing time series mining algorithms,  the period length is user-specified. We propose an algorithm that extracts  a set of candidate periods featured in a time series that satisfy a minimum  confidence threshold, by utilizing the autocorrelation function and FFT  as a filter. We extend this technique for capturing approximate periodicities.
